Recursive types for Fun

Subtyping Recursive Types in Kernel Fun

The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subtyping and parametric polymorphism, only negative results are known [17]. This paper studies the problem of subtype checking for recursive types in system kernel Fun, a typed -calculus with subtyping and bounded second o...

Subtyping Recursive Types in Kernel Fun, Preliminary Draft

The problem of deening and checking a subtype relation between recursive types was studied in AC93] for a rst order type system, but for second order systems, which combine subtyping and parametric polymorphism, only negative results are known Ghe93b]. This paper studies the problem of subtype checking for recursive types in system kernel Fun, a typed-calculus with subtyping and bounded second ...

Knitting for Fun: A Recursive Sweater

In this paper we investigate the relations between knitting and computer science. We show that the two disciplines share many concepts. Computer science, in particular algorithm theory, can suggest a lot of powerful tools that can be used both in descriptive and prescriptive ways and that apparently have not yet been used for creative knitting. The obtained results are short (optimal size) recu...

Games for Recursive Types

We present results concerning the solution of recursive domain equations in the category G of games, which is a modiied version of the category presented in AJM94]. New constructions corresponding to lifting and separated sum for games are presented, and are used to generate games for two simple recursive types: the vertical and lazy natural numbers. Recently, the \game semantics" paradigm has ...

On Fun tions and Types